"SNARG" meaning in All languages combined

{
  "forms": [
    {
      "form": "SNARGs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "SNARG (plural SNARGs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "alt_of": [
        {
          "word": "succinct non-interactive argument"
        }
      ],
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Cryptography",
          "orig": "en:Cryptography",
          "parents": [
            "Computer science",
            "Formal sciences",
            "Mathematics",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "2018, Dan Boneh, Yuval Ishai, Amit Sahai, David J. Wu, Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs, Jesper Buus Nielsen, Vincent Rijmen (editors), Advances in Cryptology – EUROCRYPT 2018: 37th Annual International Conference on Cryptographic Techniques, Proceedings, Part III, Springer, LNCS 10822, page 224,\nA SNARG is publicly verifiable if anyone can verify the proofs, and it is designated-verifier if only the holder of a secret verification state (generated along with the CRS) can verify proofs."
        },
        {
          "ref": "2020, Melanie Swan, Renato P Dos Santos, Frank Witte, Quantum Computing, World Scientific, page 172:",
          "text": "However, SNARGs and SNARKs (blockchain implementations of SNARGs) rely on pre-quantum assumptions and are not post-quantum secure. Hence, lattice-based SNARGs are proposed (Boneh et al., 2017).",
          "type": "quote"
        },
        {
          "text": "2021, Yael Taumann Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang, Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs, Kobbi Nissim, Brent Waters (editors), Theory of Cryptography: 19th International Conference, TCC 2021, Proceedings, Part I, Springer, LNCS 13042, page 355,\nIn this section, we construct SNARGs for languages with a (computational) non-signaling mathsf PCP, assuming the existence of a SNARG for mathsf BatchNP."
        }
      ],
      "glosses": [
        "Acronym of succinct non-interactive argument."
      ],
      "id": "en-SNARG-en-noun-1ZWcJFji",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "cryptography",
          "cryptography"
        ],
        [
          "succinct non-interactive argument",
          "succinct non-interactive argument#English"
        ]
      ],
      "raw_glosses": [
        "(computing, cryptography) Acronym of succinct non-interactive argument."
      ],
      "tags": [
        "abbreviation",
        "acronym",
        "alt-of"
      ],
      "topics": [
        "computing",
        "cryptography",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "SNARG"
}

{
  "forms": [
    {
      "form": "SNARGs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "SNARG (plural SNARGs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "alt_of": [
        {
          "word": "succinct non-interactive argument"
        }
      ],
      "categories": [
        "English acronyms",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computing",
        "en:Cryptography"
      ],
      "examples": [
        {
          "text": "2018, Dan Boneh, Yuval Ishai, Amit Sahai, David J. Wu, Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs, Jesper Buus Nielsen, Vincent Rijmen (editors), Advances in Cryptology – EUROCRYPT 2018: 37th Annual International Conference on Cryptographic Techniques, Proceedings, Part III, Springer, LNCS 10822, page 224,\nA SNARG is publicly verifiable if anyone can verify the proofs, and it is designated-verifier if only the holder of a secret verification state (generated along with the CRS) can verify proofs."
        },
        {
          "ref": "2020, Melanie Swan, Renato P Dos Santos, Frank Witte, Quantum Computing, World Scientific, page 172:",
          "text": "However, SNARGs and SNARKs (blockchain implementations of SNARGs) rely on pre-quantum assumptions and are not post-quantum secure. Hence, lattice-based SNARGs are proposed (Boneh et al., 2017).",
          "type": "quote"
        },
        {
          "text": "2021, Yael Taumann Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang, Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs, Kobbi Nissim, Brent Waters (editors), Theory of Cryptography: 19th International Conference, TCC 2021, Proceedings, Part I, Springer, LNCS 13042, page 355,\nIn this section, we construct SNARGs for languages with a (computational) non-signaling mathsf PCP, assuming the existence of a SNARG for mathsf BatchNP."
        }
      ],
      "glosses": [
        "Acronym of succinct non-interactive argument."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "cryptography",
          "cryptography"
        ],
        [
          "succinct non-interactive argument",
          "succinct non-interactive argument#English"
        ]
      ],
      "raw_glosses": [
        "(computing, cryptography) Acronym of succinct non-interactive argument."
      ],
      "tags": [
        "abbreviation",
        "acronym",
        "alt-of"
      ],
      "topics": [
        "computing",
        "cryptography",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "SNARG"
}